Braids, the Artin Group, and the Jones Polynomial

نویسنده

  • Jordan Fassler
چکیده

This paper is about Braids and the Artin braid group Bn. After some initial definitions and examples, I proceed to show how the Jones polynomial can be derived through a representation of the braid group by the Temperley-Lieb Algebra, an approach similar to Jones’ original construction. 1 Braids, An Introduction Perhaps the most obvious place to start is with the definition [3] of a braid: Definition 1 Consider two parallel planes A and B in R, each containing n distinct points {ai} and {bi} respectively. Then an n-strand braid is a collection of n curves {xi} such that: 1. Each xi has one endpoint at an ai and an endpoint at a bi. 2. All the xi are pairwise disjoint. 3. Every plane parallel to A and B intersects each of the xi at one point or not at all.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fast Algorithm to the Conjugacy Problem on Generic Braids Ki Hyoung Ko and Jang

Random braids that are formed by multiplying randomly chosen permutation braids are studied by analyzing their behavior under Garside’s weighted decomposition and cycling. Using this analysis, we propose a polynomial-time algorithm to the conjugacy problem that is successful for random braids in overwhelming probability. As either the braid index or the number of permutation-braid factors incre...

متن کامل

A Fast Algorithm to the Conjugacy Problem on Generic Braids

Random braids that are formed by multiplying randomly chosen permutation braids are studied by analyzing their behavior under Garside’s weighted decomposition and cycling. Using this analysis, we propose a polynomial-time algorithm to the conjugacy problem that is successful for random braids in overwhelming probability. As either the braid index or the number of permutation-braid factors incre...

متن کامل

Generating random braids

We present an algorithm to generate positive braids of a given length as words in Artin generators with a uniform probability. The complexity of this algorithm is polynomial in the number of strands and in the length of the generated braids. As a byproduct, we describe a finite state automaton accepting the language of lexicographically minimal representatives of positive braids that has the mi...

متن کامل

2 6 M ay 2 00 4 Markov traces and knot invariants related to Iwahori - Hecke algebras of type B

In classical knot theory we study knots inside the 3-sphere modulo isotopy. Using the Alexander and Markov theorem, we can translate this into a purely algebraic setting in terms of Artin braid groups modulo an equivalence relation generated by ‘Markov moves’ (one of which is usual conjugation inside the braid group). V.F.R. Jones [5] used this fact in 1984 for constructing a new knot invariant...

متن کامل

The Set of Minimal Braids is co-NP-Complete

Braids ñàï Üå represented as two-dimenSional diagrams showing the crossings of strings or as words over the generators of à braid group. À minimal braid is îïå with the fewest crossings (or the shortest words) among all possible repre~entations topologically equivalent to that braid. ÒÜå main result of this paper is that the set of minimal braids is co-NP-complete. Algorithmic problems in braid...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005